Lifting Term Rewriting Derivations in Constructor Systems by Using Generators
نویسندگان
چکیده
منابع مشابه
Lifting Term Rewriting Derivations in Constructor Systems by Using Generators
Narrowing is a procedure that was first studied in the context of equational E-unification and that has been used in a wide range of applications. The classic completeness result due to Hullot states that any term rewriting derivation starting from an instance of an expression can be ‘lifted’ to a narrowing derivation, whenever the substitution employed is normalized. In this paper we adapt the...
متن کاملPartial Inversion of Constructor Term Rewriting Systems
Partial-inversion compilers generate programs which compute some unknown inputs of given programs from a given output and the rest of inputs whose values are already given. In this paper, we propose a partial-inversion compiler of constructor term rewriting systems. The compiler automatically generates a conditional term rewriting system, and then unravels it to an unconditional system. To impr...
متن کاملVerification of Code Generators Using Term Rewriting Systems
Code generators for modern compilers are difficult to construct. To build a code generator that produces correct target code, we require detailed knowledge of the intermediate representation (IR) generated by the compiler’s front-end and intimate knowledge of the instruction set available on the target machine. We then put this knowledge to use by mapping the individual IR instructions to a seq...
متن کاملModular Properties of Constructor-Sharing Conditional Term Rewriting Systems
First, using a recent modularity result Ohl94b] for unconditional term rewriting systems (TRSs), it is shown that semi-completeness is a modular property of constructor-sharing join conditional term rewriting systems (CTRSs). Second, we do not only extend results of Middeldorp Mid93] on the modularity of termination for disjoint CTRSs to constructor-sharing systems but also simplify the proofs ...
متن کاملTree lifting orderings for termination transformations of term rewriting systems
A technique to prove the termination of a given term rewriting system (TRS, for short) is presented. We propose tree lifting orderings by which from a given TRS R candidates for the termination of R can be obtained|the termination of (at least) one of these candidates guarantees the termination ofR. It should be remarked that for a given nite TRS all its candidates can be computed automatically...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2015
ISSN: 2075-2180
DOI: 10.4204/eptcs.173.7